Graphs with convex balls
نویسندگان
چکیده
In this paper, we investigate the graphs in which all balls are convex and groups acting on them geometrically (which call CB-graphs CB-groups). These have been introduced characterized by Soltan Chepoi (1983) Farber Jamison (1987). CB-groups generalize systolic (alias bridged) weakly groups, play an important role geometric group theory. We present metric local-to-global characterizations of CB-graphs. Namely, characterize $G$ as whose triangle-pentagonal complexes $X(G)$ simply connected radius at most $3$ convex. Similarly to graphs, prove a dismantlability result for $G$: show that their squares $G^2$ dismantlable. This implies Rips contractible. Finally, adapt extend approach Januszkiewicz Swiatkowski (2006) Chalopin et al. (2020) Helly biautomatic.
منابع مشابه
Graphs with 4-steiner Convex Balls
Recently a new graph convexity was introduced, arising from Steiner intervals in graphs that are a natural generalization of geodesic intervals. The Steiner tree of a set W on k vertices in a connected graph G is a tree with the smallest number of edges in G that contains all vertices of W . The Steiner interval I(W ) of W consists of all vertices in G that lie on some Steiner tree with respect...
متن کاملGraphs with Hamiltonian balls
For a vertex u of a graph G and an integer r, the ball of radius r centered at u is the subgraph Gr(u) induced by the set of all vertices of G whose distance from u does not exceed r. We investigate the set 1i of connected graphs G with at least 3 vertices such that every ball of radius 1 in G has a Hamilton cycle. We prove that every graph G in 1-£ with n vertices has at least 2n 3 edges, and ...
متن کاملCovering Large Balls with Convex Sets in Spherical Space
If the n-dimensional unit sphere is covered by finitely many spherically convex bodies, then the sum of the inradii of these bodies is at least π. This bound is sharp, and the equality case is characterized. MSC 2000: 52A55, 52C17
متن کاملTouching Graphs of Unit Balls
The touching graph of balls is a graph that admits a representation by non-intersecting balls in the space (of prescribed dimension), so that its edges correspond to touching pairs of balls. By a classical result of Koebe [?], the disc touching graphs are exactly the planar graphs. This paper deals with a recognition of unit-ball touching graphs. The 2– dimensional case was proved to be NP-hard...
متن کاملCovering Planar Graphs with a Fixed Number of Balls
In this note, we prove that there exists a constant ρ such that any planar graph G of diameter ≤ 2R can be covered with at most ρ balls of radius R, a result conjectured by C. Gavoille, D. Peleg, A. Raspaud, and E. Sopena in 2001.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geometriae Dedicata
سال: 2023
ISSN: ['0046-5755', '1572-9168']
DOI: https://doi.org/10.1007/s10711-023-00803-0